An algorithm for LET-analysis.
نویسنده
چکیده
An algorithm for the derivation of LET-distributions from pulse-height spectra obtained with proportional counters is described. The method is based on Fourier transformation; it is applicable to spherical as well as non-spherical proportional counters. The relation between the energy mean, E,, of LET and the energy mean, g , , of the lineal energy density is given. 1. Introduction Tissue equivalent proportional counters are frequently used for the analysis of LET-distributions in neutron fields (Rossi and Rosenzweig 1955; Wilson and Field 1970). The method is limited by the fact that the experimentally observed pulse height distributions are the result of various random factors which cannot in general be easily separated. These limitations of the LET-analysis with proportional counters have been one of the starting points of microdosimetry when R'ossi and his co-workers realized that the observed distributions are more closely related to the biological effectiveness of a given type of radiation than the distribution of linear energy transfer. Linear energy transfer is only a mean value of the rate of energy loss of a charged particle along it's track, while the observed pulse height distributions reflect the actual variations of energy deposit'ion in the irradiated tissue. There are, however, cases where one needs an approximate overall evaluation of radiation quality for the purpose of comparing different types of radiation. I n these cases, and this refers particularly to radiotherapy and to radiation protection applications, LET-distributions offer a convenient frame of reference. It is for this reason that the present paper re-evaluates the algorithm used in the LET-analysis. The established method of LET analysis (Rossi and Rosenzweig 1955) is based on the assumption that energy loss straggling of the heavy charged particle, radial extension of its 8-ray halo and finite length of its track can be neglected. It is assumed that a charged particle traverses the sensitive region of the counter without change of its LET, and that the energy deposited is the product of the LET and of the chord length in the region. These assumptions are tenable only under the t'wo conditions: (i) that the neutron energies are high enough so that most of the recoil tracks are long compared with the dimensions of t'he region and (ii) that the stopping power of the particles and the diameter of the region are large enough that energy loss straggling and the efflux and influx of &rays can be neglected. Strictly …
منابع مشابه
A Common Fixed Point Theorem Using an Iterative Method
Let $ H$ be a Hilbert space and $C$ be a closed, convex and nonempty subset of $H$. Let $T:C rightarrow H$ be a non-self and non-expansive mapping. V. Colao and G. Marino with particular choice of the sequence ${alpha_{n}}$ in Krasonselskii-Mann algorithm, ${x}_{n+1}={alpha}_{n}{x}_{n}+(1-{alpha}_{n})T({x}_{n}),$ proved both weak and strong converging results. In this paper, we generalize thei...
متن کاملA hybrid algorithm for the path center problem
Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...
متن کاملAn efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کاملConversion of Network Problem with Transfer Nodes, and Condition of Supplying the Demand of any Sink from the Particular Source to the Transportation Problem
In this article we present an algorithm for converting a network problem with several sources and several sinks including several transfer nodes and condition of supplying the demand of any sink from a particular source to the transportation problem. Towards this end, and considering the very special structure of transportation algorithm, after implementing the shortest path algorithm or ...
متن کاملAn Ant Colony Optimization Algorithm for Network Vulnerability Analysis
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...
متن کاملA New Algorithm for Load Flow Analysis in Autonomous Networks
In this paper, a novel algorithm for the load flow analysis problem in an islanded microgrid is proposed. The problem is modeled without any slack bus by considering the steady state frequency as one of the load flow variables. To model different control modes of DGs, such as droop, PV and PQ, in an islanded microgrid, a new formula for load flow equations is proposed. A hybrid optimization alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physics in medicine and biology
دوره 17 2 شماره
صفحات -
تاریخ انتشار 1972